Chaos expansion of uniformly distributed random variables and application to number theory
نویسندگان
چکیده
منابع مشابه
Ascending runs in dependent uniformly distributed random variables: Application to wireless networks
We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is characterized by the fact that two successive random variables cannot take the same value. Using a Markov chain approach, we study the distribution of the maximal ascending run and we develop an algorithm to co...
متن کاملRandom numbers and random matrices: Quantum chaos meets number theory
The statistical analysis of the eigenvalues of quantum systems has become an important tool in understanding the connections between classical and quantum physics. The statistical properties of the eigenvalues of a quantum system whose classical counterpart is integrable match those of random numbers. The eigenvalues of a chaotic classical system have statistical properties like those of the ei...
متن کاملconstruction and validation of translation metacognitive strategy questionnaire and its application to translation quality
like any other learning activity, translation is a problem solving activity which involves executing parallel cognitive processes. the ability to think about these higher processes, plan, organize, monitor and evaluate the most influential executive cognitive processes is what flavell (1975) called “metacognition” which encompasses raising awareness of mental processes as well as using effectiv...
Generating uniformly distributed random networks.
The analysis of real networks taken from the biological, social, and physical sciences often requires a carefully posed statistical null-hypothesis approach. One common method requires comparing real networks to an ensemble of random matrices that satisfy realistic constraints in which each different matrix member is equiprobable. We discuss existing methods for generating uniformly distributed...
متن کاملUniformly-Distributed Random Generation of Join Orders
In this paper we study the space of operator trees that can be used to answer a join query, with the goal of generating elements form this space at random. We solve the problem for queries with acyclic query graphs. We rst count, in O(n 3) time, the exact number of trees that can be used to evaluate a given query on n relations. The intermediate results of the counting procedure then serve to g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Modern Stochastics: Theory and Applications
سال: 2021
ISSN: 2351-6046,2351-6054
DOI: 10.15559/21-vmsta172